Stability of i-connectivity parameters under edge addition
نویسندگان
چکیده
The inclusive edge (vertex, mixed) connectivity of a vertex v is the minimum number of edges (vertices, graph elements) whose removal yields a subgraph in which v is a cutvertex. Stability under edge addition, in which the value of the parameter remains unchanged with the addition of any edge, is investigated. In particular we examine relationships between stability of the inclusive vertex connectivity parameter and stability of the inclusive mixed connectivity parameter, affirming a conjecture posed in [5].
منابع مشابه
A Survey on Complexity of Integrity Parameter
Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity and its properties in vulnerability calculation. The integrity of a graph G, I(G), is defined t...
متن کاملOn Second Atom-Bond Connectivity Index
The atom-bond connectivity index of graph is a topological index proposed by Estrada et al. as ABC (G) uvE (G ) (du dv 2) / dudv , where the summation goes over all edges of G, du and dv are the degrees of the terminal vertices u and v of edge uv. In the present paper, some upper bounds for the second type of atom-bond connectivity index are computed.
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملSufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملVulnerability Measure of a Network - a Survey
In this paper we discuss about tenacity and its properties in stability calculation. We indicate relationships between tenacity and connectivity, tenacity and binding number, tenacity and toughness. We also give good lower and upper bounds for tenacity. Since we are primarily interested in the case where disruption of the graph is caused by the removal of a vertex or vertices (and the resulting...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 13 شماره
صفحات -
تاریخ انتشار 1996